A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem
نویسندگان
چکیده
Biogeography-based optimization (BBO) algorithm is a new kind of optimization technique based on biogeography concept. This population-based algorithm uses the idea of the migration strategy of animals or other species for solving optimization problems. In this paper, the BBO algorithm is developed for flexible job shop scheduling problem (FJSP). It means that migration operators of BBO are developed for searching a solution area of FJSP and finding the optimum or near-optimum solution to this problem. In fact, the main aim of this paper was to provide a new way for BBO to solve scheduling problems. To assess the performance of BBO, it is also compared with a genetic algorithm that has the most similarity with the proposed BBO. This similarity causes the impact of different neighborhood structures being minimized and the differences among the algorithms being just due to their search quality. Finally, to evaluate the distinctions of the two algorithms much more elaborately, they are implemented on three different objective functions named makespan, critical machine work load, and total work load ofmachines. BBO is also compared with some famous algorithms in the literature.
منابع مشابه
An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملSolving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کامل